A hybrid genetic–firefly algorithm for engineering design problems

نویسندگان

چکیده

Abstract Firefly algorithm (FA) is a new random swarm search optimization that modeled after movement and the mutual attraction of flashing fireflies. The number fitness comparisons attractions in FA varies depending on model. A large can induce oscillations, while small cause early convergence add to computational time complexity. This study aims offer H-GA–FA, hybrid combines two metaheuristic algorithms, genetic (GA) FA, overcome flaws combine benefits both algorithms solve engineering design problems (EDPs). In this system, which blends concepts GA individuals are formed generation not only by processes but also mechanisms prevent falling into local optima, introduce sufficient diversity solutions, make equilibrium between exploration/exploitation trends. On other hand, deal with violation constraints, chaotic process was utilized keep solutions feasible. proposed H-GA–FA tested well-known test contain set 17 unconstrained multimodal functions 7 constrained benchmark problems, where results have confirmed superiority overoptimization methods. Finally, performance investigated many EDPs. Computational show competitive better than

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

a hybrid neural networks-coevolution genetic algorithm for multi variables robust design problem in quality engineering

in this study, a hybrid algorithm is presented to tackle multi-variables robust design problem. the proposed algorithm comprises neural networks (nns) and co-evolution genetic algorithm (cga) in which neural networks are as a function approximation tool used to estimate a map between process variables. furthermore, in order to make a robust optimization of response variables, co-evolution algor...

متن کامل

Cultural Algorithm for Engineering Design Problems

Many engineering optimization problems can be state as function optimization with constrained, intelligence optimization algorithm can solve these problems well. Cultural Algorithms are a class of computational models derived from observing the cultural evolution process in nature, cultural algorithms in the optimization of the complex constrained functions of its superior performance. Experime...

متن کامل

A Hybrid Flower Pollination Algorithm for Engineering Optimization Problems

Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. Combining with the features of flower pollination algorithm, an improved simulated annealing algorithm is proposed in this paper (FPSA). It can improve the speed of annealing. The initial state of simulated annealing and new solutions are generated by flower pollination. There...

متن کامل

FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems

These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...

متن کامل

A Hybrid Co-evolutionary Particle Swarm Optimization Algorithm for Solving Constrained Engineering Design Problems

This paper presents an effective hybrid coevolutionary particle swarm optimization algorithm for solving constrained engineering design problems, which is based on simulated annealing (SA) , employing the notion of co-evolution to adapt penalty factors. By employing the SAbased selection for the best position of particles and swarms when updating the velocity in co-evolutionary particle swarm o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational Design and Engineering

سال: 2022

ISSN: ['2288-5048', '2288-4300']

DOI: https://doi.org/10.1093/jcde/qwac013